2 00 4 A note on dimensions of polynomial size circuits ∗
نویسنده
چکیده
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i ≥ 0, P/poly has ith order scaled p 3 -strong dimension 0. We also show that P/poly i.o. has p 3 -dimension 1/2, p 3 -strong dimension 1. Our results improve previous measure results of Lutz (1992) and dimension results of Hitchcock and Vinodchandran (2004).
منابع مشابه
A note on dimensions of polynomial size circuits
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i ≥ 0, P/poly has ith order scaled p 3 -strong dimension 0. We also show that P/poly i.o. has p 3 -dimension 1/2, p 3 -strong dimension 1. Our results improve previous measure results of Lutz (1992) and dimension results of Hitchcock and Vinodchandran (2004).
متن کاملOptimal Quantum Circuits for Nearest-Neighbor Architectures
We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z where k ≥ 2 is the same (up to a constant factor) as in the standard model where arbitrary interactions are allowed. This allows minimum-depth circuits (up to a constant factor) for the nearest-neighbor architecture to be obtained fr...
متن کاملNotes on Complexity Theory Lecture 11
We have seen that there exist “very hard” languages (i.e., languages that require circuits of size (1 − ε)2n/n). If we can show that there exists a language in NP that is even “moderately hard” (i.e., requires circuits of super-polynomial size) then we will have proved P 6 = NP. (In some sense, it would be even nicer to show some concrete language in NP that requires circuits of super-polynomia...
متن کاملMultiple Product Modulo Arbitrary Numbers
Let n binary numbers of length n be given. The Boolean function ``Multiple Product'' MPn asks for (some binary representation of ) the value of their product. It has been shown (K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7, 285 292 (1994)) that this function can be computed in polynomial-size threshold circu...
متن کاملA note on non-broken-circuit sets and the chromatic polynomial
1. Definitions and a main result 2 1.1. Graphs and colorings . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2. Symmetric functions . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3. Chromatic symmetric functions . . . . . . . . . . . . . . . . . . . . . 5 1.4. Connected components . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.5. Circuits and broken circuits . . . . ...
متن کامل